The growing complexity of optimization problems in distributed systems (DSs) has motivated computer scientists to strive for\nefficient approaches. This paper presents a novel cooperative algorithm inspired by chaosââ?¬â??order transition in a chaotic ant swarm\n(CAS). This work analyzes the basic dynamic characteristics of a DS in light of a networked multi agent system at microlevel\nand models a mapping from state set to self-organization mechanism set under the guide of system theory at macro level. A\ncollaborative optimization algorithm (COA) inDS based on the chaosââ?¬â??order transition of CAS is then devised. To verify the validity\nof the proposed model and algorithm, we solve a locality-based task allocation in a networked multi agent system that uses COA.\nSimulations show that our algorithm is feasible and effective compared with previous task allocation approaches, thereby illustrating\nthat our design ideas are correct.
Loading....